Linear Recurrence Relations for Sums of Products of Two Terms
نویسنده
چکیده
For a sum of the form ∑ k F (n, k)G(n, k), we set up two systems of equations involving shifts of F (n, k) and G(n, k). Then we solve the systems by utilizing the recursion of F (n, k) and the method of undetermined coefficients. From the solutions, we derive linear recurrence relations for the sum. With this method, we prove many identities involving Bernoulli numbers and Stirling numbers.
منابع مشابه
Linear Recurrence Sequences with Indices in Arithmetic Progression and Their Sums
For an arbitrary homogeneous linear recurrence sequence of order d with constant coe cients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coe cients of these recurrences are given explicitly in terms of partial Bell polynomials that depend on at most d 1 terms of the generalized Lucas sequence associated with the given recurrence. We also provi...
متن کاملAdvanced Computer Algebra Algorithms for the Expansion of Feynman Integrals
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+ ε-dimensional Minkowski space, can be transformed to multi-integrals or multisums over hyperexponential and/or hypergeometric functions depending on a discrete parameter n. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist–Zeilberger algorit...
متن کاملAlgorithms to solve coupled systems of differential equations in terms of power series
Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their powe...
متن کاملDenominator Bounds for Systems of Recurrence Equations using $\Pi\Sigma$-Extensions
We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, q-hypergeometric products or their mixed versions. These linear systems are formulated in the setting of ΠΣ -extensions and our goal is to find a denominator bound (also known as universal denominator) for ...
متن کاملMore Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011